LOGMIP : a discrete continuous nonlinear optimizer
نویسندگان
چکیده
Discrete-continuous non-linear optimization models are frequently used to formulate problems in Process System Engineering. Major modeling alternatives and solution algorithms include generalized disjunctive programming and MINLP. Both have advantages and drawbacks depending on the problem they are dealing with. In this work, we describe the theory behind LOGMIP, a new computer code for disjunctive programming and MINLP. We discuss a hybrid modeling framework which combines both approaches, allowing binary variables and disjunctions for expressing discrete choices. An extension of the Logic-Based OA algorithm has been implemented to solve the proposed hybrid model. Computational experience is reported on several examples, which are solved within disjunctive, MINLP and hybrid approaches.
منابع مشابه
LOGMIP: a disjunctive 0–1 non-linear optimizer for process system models
Discrete-continuous non-linear optimization models are frequently used to formulate problems in process system engineering. Major modeling alternatives and solution algorithms include generalized disjunctive programming and mixed integer non-linear programming (MINLP). Both have advantages and drawbacks depending on the problem they are dealing with. In this work, we describe the theory behind ...
متن کاملComputational Experience with Logmip Solving Linear and Nonlinear Disjunctive Programming Problems
The objectives of this paper are to give a brief overview of the code LogMIP and to report numerical experience on a set of test problems. LOGMIP is currently the only code for disjunctive programming, which has implemented the research work done on this area on the last decade. Major motivations in the development of LogMIP have been to facilitate problem formulation of discrete/continuous opt...
متن کاملDISCRETE AND CONTINUOUS SIZING OPTIMIZATION OF LARGE-SCALE TRUSS STRUCTURES USING DE-MEDT ALGORITHM
Design optimization of structures with discrete and continuous search spaces is a complex optimization problem with lots of local optima. Metaheuristic optimization algorithms, due to not requiring gradient information of the objective function, are efficient tools for solving these problems at a reasonable computational time. In this paper, the Doppler Effect-Mean Euclidian Distance Threshold ...
متن کاملInvariant functions for solving multiplicative discrete and continuous ordinary differential equations
In this paper, at first the elemantary and basic concepts of multiplicative discrete and continous differentian and integration introduced. Then for these kinds of differentiation invariant functions the general solution of discrete and continous multiplicative differential equations will be given. Finaly a vast class of difference equations with variable coefficients and nonlinear difference e...
متن کاملCombining the Strengths of the Bayesian Optimization Algorithm and Adaptive Evolution Strategies
This paper proposes a method that combines competent genetic algorithms working in discrete domains with adaptive evolution strategies working in continuous domains. We use discretization to transform solution between the two domains. The results of our experiments with the Bayesian optimization algorithm as a discrete optimizer and -selfadaptive mutation of evolution strategies as a continuous...
متن کامل